The Inverses of Block Hankel and Block Toeplitz Matrices
نویسندگان
چکیده
A set of new formulae for the inverse of a block Hankel (or block Toeplitz) matrix is given. The formulae are expressed in terms of certain matrix Pad6 forms, which approximate a matrix power series associated with the block Hankel matrix. By using Frobenius-type identities between certain matrix Pad6 forms, the inversion formulae are shown to generalize the formulae of Gohberg-Heinig and, in the scalar case, the formulae of Gohberg-Semencul and Gohberg-Krupnik. The new formulae have the significant advantage of requiring only that the block Hankel matrix itself be nonsingular. The other formulae require, in addition, that certain submatrices be nonsingular. Since effective algorithms for computing the required matrix Pad6 forms are available, the formulae are practical. Indeed, some of the algorithms allow for the efficient calculation of the inverse not only of the given block Hankel matrix, but also of any nonsingular block principal minor.
منابع مشابه
Kronecker product approximations for dense block Toeplitz-plus-Hankel matrices
In this paper, we consider the approximation of dense block Toeplitz-plus-Hankel matrices by sums of Kronecker products. We present an algorithm for efficiently computing the matrix approximation that requires the factorization of matrices of much smaller dimension than that of the original. The main results are described for block Toeplitz matrices with Toeplitz-plus-Hankel blocks (BTTHB), but...
متن کاملInversion Components of Block Hankel-like Matrices
The inversion problem for square matrices having the structure of a block Hankel-like matrix is studied. Examples of such matrices in&de Hankel striped, Hankel layered, and vector Hankel matrices. It is shown that the components that both determine nonsingularity and construct the inverse of such matrices are closely related to certain matrix polynomials. These matrix polynomials are multidimen...
متن کاملBlock Factorization of Hankel Matrices and Euclidean Algorithm
It is shown that a real Hankel matrix admits an approximate block diagonalization in which the successive transformation matrices are upper triangular Toeplitz matrices. The structure of this factorization was first fully discussed in [1]. This approach is extended to obtain the quotients and the remainders appearing in the Euclidean algorithm applied to two polynomials u(x) and v(x) of degree ...
متن کاملEvaluation of a Fast Algorithm for the Eigen-Decomposition of Large Block Toeplitz Matrices with Application to 5D Seismic Data Interpolation
We present a fast 5D (frequency and 4 spatial axes) reconstruction method that uses Multichannel Singular Spectrum Analysis / Cazdow algorithm. Rather than embedding the 4D spatial volume in a Hankel matrix, we propose to embed the data into a block Toeplitz form. Rank reduction is carried out via Lanczos bidiagonalization with fast block Toeplitz matrix-times-vector multiplications via 4D Fast...
متن کاملOptimization over Positive Polynomial Matrices
Positive polynomial matrices play a fundamental role in systems and control theory. We give here a simplified proof of the fact that the convex set of positive polynomial matrices can be parameterized using block Hankel and block Toeplitz matrices. We also show how to derive efficient computational algorithms for optimization problems over positive pseudo polynomial matrices over the real line,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Comput.
دوره 19 شماره
صفحات -
تاریخ انتشار 1990